var crypto/rsa.bigOne

12 uses

	crypto/rsa (current package)
		rsa.go#L39: var bigOne = big.NewInt(1)
		rsa.go#L209: 	modulus := new(big.Int).Set(bigOne)
		rsa.go#L212: 		if prime.Cmp(bigOne) <= 0 {
		rsa.go#L230: 		pminus1 := new(big.Int).Sub(prime, bigOne)
		rsa.go#L232: 		if congruence.Cmp(bigOne) != 0 {
		rsa.go#L318: 		n := new(big.Int).Set(bigOne)
		rsa.go#L319: 		totient := new(big.Int).Set(bigOne)
		rsa.go#L323: 			pminus1.Sub(prime, bigOne)
		rsa.go#L463: 	priv.Precomputed.Dp = new(big.Int).Sub(priv.Primes[0], bigOne)
		rsa.go#L466: 	priv.Precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne)
		rsa.go#L477: 		values.Exp = new(big.Int).Sub(prime, bigOne)
		rsa.go#L516: 				r = bigOne